Anti-SAT: Mitigating SAT Attack on Logic Locking
نویسندگان
چکیده
منابع مشابه
Anti-SAT: Mitigating SAT Attack on Logic Locking
Logic locking is a technique that’s proposed to protect outsourced IC designs from piracy and counterfeiting by untrusted foundries. A locked IC preserves the correct functionality only when a correct key is provided. Recently, the security of logic locking is threatened by a new attack called SAT attack, which can decipher the correct key of most logic locking techniques within a few hours [1]...
متن کاملMitigating SAT Attack on Logic Locking
Logic locking is a technique that has been proposed to protect outsourced IC designs from piracy and counterfeiting by untrusted foundries. A locked IC preserves the correct functionality only when a correct key is provided. Recently, the security of logic locking is threatened by a new attack called SAT attack, which can decipher the correct key of most logic locking techniques within a few ho...
متن کاملSAT-based Bit-flipping Attack on Logic Encryptions
Logic encryption is a hardware security technique that uses extra key inputs to prevent unauthorized use of a circuit. With the discovery of the SAT-based attack, new encryption techniques such as SARLock and Anti-SAT are proposed, and further combined with traditional logic encryption techniques, to guarantee both high error rates and resilience to the SAT-based attack. In this paper, the SAT-...
متن کاملA SAT attack on the Erdős-Szekeres conjecture
A classical conjecture of Erdős and Szekeres states that, for every integer k ≥ 2, every set of 2k−2 + 1 points in the plane in general position contains k points in convex position. In 2006, Peters and Szekeres introduced the following stronger conjecture: every redblue coloring of the edges of the ordered complete 3-uniform hypergraph on 2k−2 + 1 vertices contains an ordered subhypergraph wit...
متن کاملA SAT Attack on the Erdős Discrepancy Conjecture
In 1930s Paul Erdős conjectured that for any positive integer C in any infinite ±1 sequence (xn) there exists a subsequence xd, x2d, x3d, . . . , xkd, for some positive integers k and d, such that | ∑k i=1 xid |> C. The conjecture has been referred to as one of the major open problems in combinatorial number theory and discrepancy theory. For the particular case of C = 1 a human proof of the co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
سال: 2019
ISSN: 0278-0070,1937-4151
DOI: 10.1109/tcad.2018.2801220